Characterization theorems for constrained approximation problems via optimization theory
نویسندگان
چکیده
منابع مشابه
Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
Due to their fundamental nature and numerous applications, sphere constrained polynomial optimization problems have received a lot of attention lately. In this paper, we consider three such problems: (i) maximizing a homogeneous polynomial over the sphere; (ii) maximizing a multilinear form over a Cartesian product of spheres; and (iii) maximizing a multiquadratic form over a Cartesian product ...
متن کاملWEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS
The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...
متن کاملSolving constrained optimization problems via Subset Simulation
This paper extends the application of Subset Simulation (SS), an advanced Monte Carlo algorithm for reliability analysis, to solve constrained optimization problems encountered in engineering. The proposed algorithm is based on the idea that an extreme event (optimization problem) can be considered as a rare event (reliability problem). The Subset Simulation algorithm for optimization is a popu...
متن کاملAbnormal equality-constrained optimization problems: sensitivity theory
For the equality-constrained optimization problem, we consider the case when the customary regularity of constraints can be violated. Under the assumptions substantially weaker than those previously used in the literature, we develop a reasonably complete local sensitivity theory for this class of problems, including upper and lower bounds for the rate of change of the optimal value function su...
متن کاملAn Optimization via Simulation approach for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problems
In this paper a novel modelling and solving method has been developed to address the so-called resource constrained project scheduling problem (RCPSP) where project tasks have multiple modes and also the preemption of activities are allowed. To solve this NP-hard problem, a new general optimization via simulation (OvS) approach has been developed which is the main contribution of the current re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1975
ISSN: 0021-9045
DOI: 10.1016/0021-9045(75)90068-4